Exploring the Tutte-Martin connection

نویسنده

  • Joanna A. Ellis-Monaghan
چکیده

The Martin polynomial of an oriented Eulerian graph encodes information about families of cycles in the graph. This paper uses a transformation of the Martin polynomial that facilitates standard combinatorial manipulations. These manipulations result in several new identities for the Martin polynomial, including a di.erentiation formula. These identities are then applied to get new combinatorial interpretations for valuations of the Martin polynomial, revealing properties of oriented Eulerian graphs. Furthermore, Martin (Thesis, Grenoble, 1977; J. Combin. Theory, Ser. B 24 (1978) 318) and Las Vergnas (Graph Theory and Combinatorics, Research Notes in Mathematics, Vol. 34, Pitman, Boston, 1979; J. Combin. Theory, Ser. B 44 (1988) 367), discovered that if Gm, the medial graph of a connected planar graph G, is given an appropriate orientation, then m(G̃m; x) = t(G; x; x), where m(G̃; x) is the Martin polynomial of an oriented graph, and t(G; x; y) is the Tutte, or dichromatic, polynomial. This relationship, combined with the new evaluations of the Martin polynomial, reveals some surprising properties of the Tutte polynomial of a planar graph along the diagonal x=y. For small values of x and y that correspond to points where interpretations of the Tutte polynomial are known, this leads to some interesting combinatorial identities, including a new interpretation for the beta invariant of a planar graph. Combinatorial interpretations for some values of the derivatives of t(G; x; x) for a planar graph G are also found. c © 2003 Elsevier B.V. All rights reserved. MSC: 05C38; 05C45

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Isotropic systems and the interlace polynomial

Through a series of papers in the 1980’s, Bouchet introduced isotropic systems and the Tutte-Martin polynomial of an isotropic system. Then, Arratia, Bollobás, and Sorkin developed the interlace polynomial of a graph in [ABS00] in response to a DNA sequencing application. The interlace polynomial has generated considerable recent attention, with new results including realizing the original inte...

متن کامل

Tutte polynomials of wheels via generating functions

We find an explicit expression of the Tutte polynomial of an $n$-fan. We also find a formula of the Tutte polynomial of an $n$-wheel in terms of the Tutte polynomial of $n$-fans. Finally, we give an alternative expression of the Tutte polynomial of an $n$-wheel and then prove the explicit formula for the Tutte polynomial of an $n$-wheel.

متن کامل

Homomorphisms and Polynomial Invariants of Graphs

This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial. This connection enables us to extend the study to other important polynomial invariants associated with graphs, and closely related to the Tutte polynomial. We then obtain applications of these relationships in several areas, including Abelian Groups and Statistical Physics. A new type of unique...

متن کامل

Splitting Formulas for Tutte Polynomials

We present two splitting formulas for calculating the Tutte polynomial of a matroid. The rst one is for a generalized parallel connection across a 3-point line of two matroids and the second one is applicable to a 3-sum of two matroids. An important tool used is the bipointed Tutte polynomial of a matroid, an extension of the pointed Tutte polynomial introduced by Thomas Brylawski in Bry71].

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Mathematics

دوره 281  شماره 

صفحات  -

تاریخ انتشار 2004